Some news about the independence number of a graph
نویسندگان
چکیده
منابع مشابه
Some news about the independence number of a graph
For a finite undirected graph G on n vertices some continuous optimization problems taken over the n-dimensional cube are presented and it is proved that their optimum values equal the independence number of G.
متن کاملInverse Independence Number of a Graph
The concept of inverse domination was introduced by Kulli V.R. and Sigarakanti S.C. [9] . Let D be a set of G. A dominating set D1 VD is called an inverse dominating set of G with respect to D. The inverse domination number (G) is the order of a smallest inverse dominating set. Motivated by this definition we define another parameter as follows. Let D be a maximum independent set in G. ...
متن کاملUniform Number of a Graph
We introduce the notion of uniform number of a graph. The uniform number of a connected graph $G$ is the least cardinality of a nonempty subset $M$ of the vertex set of $G$ for which the function $f_M: M^crightarrow mathcal{P}(X) - {emptyset}$ defined as $f_M(x) = {D(x, y): y in M}$ is a constant function, where $D(x, y)$ is the detour distance between $x$ and $y$ in $G$ and $mathcal{P}(X)$ ...
متن کاملRelation Between Convexity Number and Independence Number of a Graph
The convexity number denoted by in a connected graph is the maximum cardinality of a proper convex set in . Here in this paper graphs for which the independence number ( ) of a graph where ( ) = , ( ) < and ( ) > are completely characterised. Also graphs for which ( ) = are characterised. Construction of graphs with prescribed ( ) and are presented.
متن کاملA lower bound on the independence number of a graph
For a connected and non-complete graph, a new lower bound on its independence number is proved. It is shown that this bound is realizable by the well known efficient algorithm MIN.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2000
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1107